analyz taxonom classif extens markov model visual dhint boundari segment algorithm imag segment data mine approach predict phylum microbi organ genom dwide sequenc data compar studi outlier detect algorithm visual dna frna structur tempor cgr onlin mine risk level traffic anomali user es feedback rare event detect spatiotempor environ effici mine emerg event dynam spatiotempor environ mine develop trend dynam spatiotempor data stream abstract paper present effici model techniqu data stream dynam spatiotempor environ suitabl mine develop trend stream data model data structur interleav semi unsupervis cluster algorithm dynam markov chain granular cluster calibr global constraint inher data stream oper propos identifi develop trend oper includ delet obsolet event slide window scheme identifi emerg event base score scheme deriv synopsi obtain model process propos techniqu increment scalabl adapt suitabl onlin process algorithm analysi experi demonstr effici effect propos techniqu index term data mine data stream cluster markov chain develop trend mobil inform manag octob data broadcast classif scalabl oat report author mine signific usag pattern clickstream data spatiotempor predict data mine tool mobilact mobil transact framework support spatial replic spatial consist extens markov model cluster stream continu arriv data import applic data mine recent year effici algorithm propos research cluster neglect fact data data stream character proxim data point cluster tempor compon extens markov model emm add tempor compon data stream cluster superimpos dynam adapt markov chain paper introduc implement extens packag remm implement emm top simpl cluster algorithm data stream discuss exampl applic abstract collect mobil inform manag execut summari mobil inform manag inform map index dai effici data mine maxim frequent subtre concurr control perform dai correl variabl improv spatiotempor forecast improv web site effect page tempor inform semant cach queri process data cach local client plai import role improv perform client server system paper introduc cach scheme call semant cach unlik tradit page cach tupl cach semant cach defin access base queri submit client predic result tupl queri cach queri request partial result obtain queri process semant cach advantag low overhead effici flexibl semant cach scheme mobil comput environ heterogen system gener client server system formal definit semant cach relat concept report discuss semant cach manag issu investig semant cach queri process techniqu keyword semant cach semant segment queri queri trim coalesc cach replac satisfi implic data mine introductori advanc topic stiff forecast framework spatio dtempor data locat depend benchmark mobil behavior stiff forecast framework spatio dtempor data stiff forecast framework spatiotempor data stiff forecast framework spatiotempor data tcot da timeout dbase mobil transact commit protocol present transact commit protocol transact commit timeout tcot base timeout approach mobil databas system md univers reach final transact termin decis commit abort messag orient system suit wireless environ timeout mechan minim impact slow unreli wireless link compar tcot modifi version pc show superior base commit time architectur locat depend queri process mobil peopl increas anytim comput advanc wireless commun geograph posit mobil user estim accur access data depend locat awar enabl kind servic specif local inform great flexibl end user creat challeng content provid wireless oper propos architectur locat depend servic manag ldsm mobil user servic content provid servic locat depend applic access locat depend data propos middlewar locat translat call locat level adjust locat granular solv locat mismatch problem qualiti queri result complic queri involv servic provid support middlewar paper give overview propos architectur examin queri process issu discuss futur work plan buc pour obtent du grade de docteur scienc par interact cluster transact data locat depend queri process effici mine travers pattern low dcost checkpoint techniqu distribut databas semant cach manag locat depend data mobil comput locat depend applic popular mobil environ improv system perform facilit disconnect cach crucial applic paper semant cach scheme access locat depend data mobil comput develop mobil model repres move behavior mobil user formal defin locat depend queri investig queri process cach manag strategi perform semant cach scheme replac strategi evalu simul studi result show semant cach flexibl effect ldd applic page cach perform sensit databas physic organ notic semant cach replac strategi util semant local term locat perform robustli kind workload main memori mine associ rule propos famili larg itemset count algorithm adapt amount main memori histor sampl data potenti larg itemset candid fals candid identi earlier redund comput reduc cpu time reduc count dierent size candid dynam trie count candid earlier count candid scan algorithm reduc number scan requir introduct mine associ rule attract lot interest recent year introduc associ rule problem formal state fi set liter call item set transact call itemset associ rule hold confid transact impact mobil transact manag examin impact mobil dierent option manag mobil transact analyt perform studi show manag approach perform impact locat manag strategi primari object work illustr underli implement strategi impact mobil transact process consid propos mobil transact process techniqu introduct mobil transact user access databas mobil unit mu wireless link research studi examin dierent mobil transact mt model scheme manag mt suggest mu respons manag mt suggest bss msc respons propos manag move mu request mt investig cluster effect manag semant cach mobil comput semant cach attract mobil comput environ due content base reason abil fact requir data oppos file page data transmit wireless link paper propos cluster base approach manag semant cach aim examin make semant local queri workload cach replac perform techniqu shown outperform lru scheme tempor local consid index valid time databas dtree present approach name map standard tree multipl disk singl processor architectur provid effici index valid time rang approach base map dimension rang dimension point lexicograph order rang preserv compar map time index tree show map compar outperform depend number tree util degre parallel type queri main contribut paper show standard tree virtual dbm provid effici tempor index discuss made term valid time databas map extend applic domain introduct paper deal problem index dimension rang assum domain applic tempor locat depend data manag mobil databas locat depend data data depend locat object paper introduc topic spawn relatedresearch introduct tradit wai manag data relationship data geograph locat organ repres wireless comput properti locat transpar fact replac locat depend properti mode issu queri geograph locat queri origin issu data determin outcom locat depend data ldd refer data valu depend locat exampl illustr point ldd hotel inform suppos travel inform locat room rent hotel middl journei issu queri obtain inform answer queri depend geograp mine associ rule anti dskew algorithm mine associ rule item larg databas recogn import data mine problem propos approach problem requir scan entir databas worst case paper propos techniqu overcom problem data skew basket data techniqu reduc maximum number scan case associ rule scan algorithm emploi prior knowledg collect mine process sampl reduc number candid itemset identifi fals candid itemset earlier stage common subexpress process multipl dqueri process dtree effici process inclus spatial queri extend abstract mario nascimento margaret dunham cnptia embrapa cse sea po box southern methodist univers campina sp brazil dalla tx usa mario cnptia embrapa br mhd sea smu abstract paper address problem index spatial data dimension rectangl propos approach tree index project side rectangl approach dmap easili parallel focu queri type find rectangl includ refer rectangl compar approach tree effici tree deriv investig show queri spatial distribut data parallel dmap competit parallel version dmap outperform tree virtual tree render approach practic int dtree effici process inclus spatial queri extend abstract mario nascimento margaret dunham cnptia embrapa cse sea po box southern methodist univers campina sp brazil dalla tx usa mario cnptia embrapa br mhd sea smu abstract paper address problem index spatial data dimension rectangl propos approach tree index project side rectangl approach dmap easili parallel focu queri type find rectangl includ refer rectangl compar approach tree effici tree deriv investig show queri spatial distribut data parallel dmap competit parallel version dmap outperform tree virtual tree render approach practic int propos index bitempor databas cooper dtree analog ant coloni function suggest definit comput paradigm call ant system propos viabl approach stochast combinatori optim main characterist model posit feedback distribut comput construct greedi heurist posit feedback account rapid discoveri good solut distribut comput avoid prematur converg greedi heurist help find accept solut earli stage search process appli propos methodolog classic travel salesman problem tsp report simul result discuss paramet select earli setup model compar tabu search simul anneal tsp demonstr robust approach show ant system appli optim problem asymmetr travel salesman quadrat propos index bitempor databas cooper dtree analog ant coloni function suggest definit comput paradigm call ant system propos viabl approach stochast combinatori optim main characterist model posit feedback distribut comput construct greedi heurist posit feedback account rapid discoveri good solut distribut comput avoid prematur converg greedi heurist help find accept solut earli stage search process appli propos methodolog classic travel salesman problem tsp report simul result discuss paramet select earli setup model compar tabu search simul anneal tsp demonstr robust approach show ant system appli optim problem asymmetr travel salesman quadrat survei distribut databas checkpoint checkpoint databas vital techniqu reduc recoveri time presenc failur distribut databas checkpoint effici perform global reconstruct global reconstruct infrequ distribut databas paper survei classifi previou approach checkpoint distribut databas argu restrict resourc consum approach checkpoint distribut databas integr distribut databas system argu type global checkpoint feder multidatabas system mobil transact model captur data movement behavior unlik distribut transact mobil transact origin end site implic movement transact classic atom concurr recoveri solut revisit captur movement behavior effort direct defin model mobil transact build concept split transact global transact multidatabas environ view mobil transact call kangaroo transact incorpor properti transact mobil comput system hop base station mobil unit move cell model captur movement behavior data behavior reflect access data locat databas static network mobil behavior dynam realiz model split oper data access behavior captur idea global local transact multidatabas system research partial support nation scienc foundat grant number int massiv digit data system mdd effort sponsor advanc research develop committe commun manag staff part research perform margaret dunham margaret eich sabbat univers queensland brisban australia research partial support hugh research laboratori grant number divtt index bitempor databas segment fuzzi checkpoint main memori databas due interfer databas activ fuzzi checkpoint shown suitabl main memori databas paper present fuzzi checkpoint approach call segment fuzzi checkpoint sfc greatli reduc log process time restart slightli degrad system perform sfc move window locat effici redo point fuzzi checkpoint approach concept sfc simpl flexibl analyt result show sfc speed restart oper overhead index transact ddecis time databas research found tempor databas literatur recogn support valid time transact time tempor attribut paper recogn role decis event time index techniqu encompass decis time present literatur aim fill void present index structur index transact time decis time framework structur base tree extens propos structur present effici handl case tempor data queri introduct tempor support databas discuss research assum valid time transact time support databas manag system dbm tempor databas handl transact time call rollback databas databas concurr control data flow graph log main memori databas guest editor special section data manag issu mobil comput mobil comput databas mobil comput environ involv access inform wireless network connect mobil unit stationari motion intermitt connect fix wire network technolog advanc made softwar hardwar feasibl access inform anytim realiti similar involv access inform multidatabas environ mobil comput environ propos superimpos wireless mobil comput environ multidatabas system realiz system capabl effect access larg amount data wireless medium mda mobil data access system show easili map solut environ potenti larg number user simultan access data issu involv abil concurr manag transact current concurr control scheme effici manag access address limit bandwidth frequent disconnect wireless network paper propos hierarch concurr control algorithm propos concurr control algorithm global lock tabl creat semant inform contain hierarchi perform algorithm simul result present taxonomi view oodb mmdb reload concern post dcrash log process fuzzi checkpoint main memori databas mohan levin ari im cient high concurr index manag method write ahead log proc acm sigmod int confer manag data join process relat databas join oper fundament relat databas queri oper facilit retriev inform relat base cartesian product relat join difficult oper implement effici predefin link relat requir exist foreword refer set intern guidelin recommend report present statist data metadata handbook prepar primarili short term econom statist recommend present relev annual structur statist social popul statist handbook draw heavili exist intern statist guidelin recommend develop twenti year intern organis nation statist agenc intern standard develop implement intern organis nation agenc develop develop economi articul comprehens set recommend report present statist data metadata aspect demand improv intern compar consist statist compil publish nation agenc intern organis requir driven closer econom social linkag oecd member countri countri larg emerg member economi discuss handbook major differ statist compil countri flow definit concept function complet object dorient databas mmdb reload algorithm transact definit base messag pass parallel architectur databas system highli parallel databas system start replac tradit mainfram base system market capabl handl larg transact process task problem overcom share style architectur processor privat memori disk space commun send messag intercommun network system tupl relat databas partit independ process unit consensu type architectur agreement languag paradigm develop parallel relat databas domin program paradigm data parallel paradigm suggest hide distribut structur memori user offer singl address space tightli synchron process exist processor invis programm programm spec perform flow graph lock main memori databas research direct parallel architectur databas system highli parallel databas system start replac tradit mainfram base system market capabl handl larg transact process task problem overcom share style architectur processor privat memori disk space commun send messag intercommun network system tupl relat databas partit independ process unit consensu type architectur agreement languag paradigm develop parallel relat databas domin program paradigm data parallel paradigm suggest hide distribut structur memori user offer singl address space tightli synchron process exist processor invis programm programm spec databas concurr control data flow graph graph direct lock editor note bereav life transit crisi face signific number undergradu research found point time approxim percent colleg student year bereav percent experienc death famili member friend past year balk hardison neimey lichstein death loss experi grief reaction potenti affect dai dai function develop bereav colleg student addit campus experi death member student bodi mortal rate individu ag eighteen twenti combin sex race anderson smith rate higher older ag group compris adult learner popul minino preval signific death issu campu topic death grief bereav seldom address student editor note bereav life transit crisi face signific number undergradu research found point time approxim percent colleg student year bereav percent experienc death famili member friend past year balk hardison neimey lichstein death loss experi grief reaction potenti affect dai dai function develop bereav colleg student addit campus experi death member student bodi mortal rate individu ag eighteen twenti combin sex race anderson smith rate higher older ag group compris adult learner popul minino preval signific death issu campu topic death grief bereav seldom address student editor note bereav life transit crisi face signific number undergradu research found point time approxim percent colleg student year bereav percent experienc death famili member friend past year balk hardison neimey lichstein death loss experi grief reaction potenti affect dai dai function develop bereav colleg student addit campus experi death member student bodi mortal rate individu ag eighteen twenti combin sex race anderson smith rate higher older ag group compris adult learner popul minino preval signific death issu campu topic death grief bereav seldom address student classif comparison main memori databas recoveri techniqu mar design main memori databas machin editor note bereav life transit crisi face signific number undergradu research found point time approxim percent colleg student year bereav percent experienc death famili member friend past year balk hardison neimey lichstein death loss experi grief reaction potenti affect dai dai function develop bereav colleg student addit campus experi death member student bodi mortal rate individu ag eighteen twenti combin sex race anderson smith rate higher older ag group compris adult learner popul minino preval signific death issu campu topic death grief bereav seldom address student editor note bereav life transit crisi face signific number undergradu research found point time approxim percent colleg student year bereav percent experienc death famili member friend past year balk hardison neimey lichstein death loss experi grief reaction potenti affect dai dai function develop bereav colleg student addit campus experi death member student bodi mortal rate individu ag eighteen twenti combin sex race anderson smith rate higher older ag group compris adult learner popul minino preval signific death issu campu topic death grief bereav seldom address student main memori databas recoveri present detail perform studi main memori recoveri algorithm levi silberschatz log driven backup jagadish silberschatz sudarshan recoveri main memori laps kumar partial recoveri simul model result show load balanc significantli affect perform group commit effect reduc disk oper main memori databas system jagadish silberschatz sudarshan algorithm util group commit pass log scan show desir perform normal databas oper recoveri kumar approach make volatil ram nram set mechan manag normal transact execut system recoveri levi silberschatz algorithm lack method check increas log record make recoveri time long unpredict kei word mmdb vram nram shadow updat place group commit editor note bereav life transit crisi face signific number undergradu research found point time approxim percent colleg student year bereav percent experienc death famili member friend past year balk hardison neimey lichstein death loss experi grief reaction potenti affect dai dai function develop bereav colleg student addit campus experi death member student bodi mortal rate individu ag eighteen twenti combin sex race anderson smith rate higher older ag group compris adult learner popul minino preval signific death issu campu topic death grief bereav seldom address student editor note bereav life transit crisi face signific number undergradu research found point time approxim percent colleg student year bereav percent experienc death famili member friend past year balk hardison neimey lichstein death loss experi grief reaction potenti affect dai dai function develop bereav colleg student addit campus experi death member student bodi mortal rate individu ag eighteen twenti combin sex race anderson smith rate higher older ag group compris adult learner popul minino preval signific death issu campu topic death grief bereav seldom address student editor note bereav life transit crisi face signific number undergradu research found point time approxim percent colleg student year bereav percent experienc death famili member friend past year balk hardison neimey lichstein death loss experi grief reaction potenti affect dai dai function develop bereav colleg student addit campus experi death member student bodi mortal rate individu ag eighteen twenti combin sex race anderson smith rate higher older ag group compris adult learner popul minino preval signific death issu campu topic death grief bereav seldom address student transact orient perform analysi databas machin 